A powerdomain of possibility measures

نویسنده

  • Michael Huth
چکیده

We provide a domain-theoretic framework for possibility theory by studying possibility measures on the lattice of opens of a topological space. The powerspaces Poss(X) and Poss 0;1] (X) of all such maps extend to functors in the natural way. We may think of possibility measures as continuous valuations by replacing`+' with`_' in their modular law. The functors above send continuous maps to sup-maps and continuous domains to completely distributive lattices; in the latter case they are locally continuous. Finite suprema of scalar multiples of point valuations form a basis of the powerdomains above if O(X) is the Scott-topology of a continuous domain. The notion of 0; 1]-and 0; 1]-modules corresponds to that of continuous cones if addition on the reals and on the module is replaced by suprema. The pow-erdomain Poss(D) is the free 0; 1]-module and Poss 0;1] (D) the free 0; 1]-module over a continuous domain D. 1 Possibility Measures This extended abstract attempts to recast some of the work done in quantitative domain theory within the traditional domain theory of continuous domains and lattices. We illustrate our approach with the two prime targets of quantitative analysis, the completely distributive lattices 0; 1] and 0; 1]. Given a dcpo D, there are numerous semantic scenarios in which we are interested in the function space D ! 0; 1]], or D ! 0; 1]]. For example, the former is a natural carrier of meaning for Markov chain processes 1], or quantitative model checks 2], whereas the second space could be the carrier of meaning for a cost, or running time analysis. Note that we stipulated that these functions are continuous. That way we ensure that the process of approximating total 1 Reinhold Heckmann, Klaus Keimel and Philipp S underhauf make valuable suggestions when I presented preliminary parts of this material at the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Powerdomain Elements as Monadic Second Order Predicates

This report characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a preordering of provable implication. This provides an intuitive representation which suggests a new form of powerdomain called the mixed powerdomain which expresses data in a different way from the well-known constructions from ...

متن کامل

The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces

For the semantics of probabilistic features in programming mainly two approaches are used for building models. One is the Giry monad of Borel probability measures over metric spaces, and the other is Jones’ probabilistic powerdomain monad [6] over dcpos (directed complete partial orders). This paper places itself in the second domain theoretical tradition. The probabilistic powerdomain monad is...

متن کامل

A Probabilistic Powerdomain of Evaluations

We give a probabilistic powerdomain construction on the category of inductively complete partial orders; it is the partial order of continuous [0, 11-valued evaluations on the Scott topology. By means of a theory of integration with respect to such evaluations, the powerdomain is shown to be a monad, and indeed one gets a model for Moggi’s computational lambda-calculus. One can also solve recur...

متن کامل

Categorical Domain Theory: Scott Topology, Powercategories, Coherent Categories

In the present article we continue recent work in the direction of domain theory were certain (accessible) categories are used as generalized domains. We discuss the possibility of using certain presheaf toposes as generalizations of the Scott topology at this level. We show that the toposes associated with Scott complete categories are injective with respect to dense inclusions of toposes. We ...

متن کامل

The Mixed Powerdomain

This paper characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a preordering of provable implication. The goal is to reveal the basic logical significance of the powerdomain elements by casting them in the right setting. Such a treatment may contribute to a better understanding of their potent...

متن کامل

Fuzzy relations, Possibility theory, Measures of uncertainty, Mathematical modeling.

A central aim of educational research in the area of mathematical modeling and applications is to recognize the attainment level of students at defined states of the modeling process. In this paper, we introduce principles of fuzzy sets theory and possibility theory to describe the process of mathematical modeling in the classroom. The main stages of the modeling process are represented as fuzz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1997